Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively — Derivation and implementation
نویسندگان
چکیده
منابع مشابه
Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - Derivation and implementation
In this paper, by using parallel computing along with recursion, we describe a reliable symbolic computational algorithm for inverting cyclic pentadiagonal matrices. The algorithm is implemented in MAPLE. Two other symbolic algorithms are developed and the computational costs for all algorithms are given. An example is presented for the sake of illustration. © 2009 Elsevier Ltd. All rights rese...
متن کاملA New Algorithm for Inverting General Cyclic Heptadiagonal Matrices Recursively
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The algorithm is implementable to the Computer Algebra System(CAS) such as MAPLE, MATLAB and MATHEMATICA. An example is presented for the sake of illustration.
متن کاملOn the Inverse Of General Cyclic Heptadiagonal and Anti-Heptadiagonal Matrices
In the current work, the author present a symbolic algorithm for finding the determinant of any general nonsingular cyclic heptadiagonal matrices and inverse of anti-cyclic heptadiagonal matrices. The algorithms are mainly based on the work presented in [A. A. KARAWIA, A New Algorithm for Inverting General Cyclic Heptadiagonal Matrices Recursively, arXiv:1011.2306v1 [cs.SC]]. The symbolic algor...
متن کاملHsiao-Code Check Matrices and Recursively Balanced Matrices
The key step of generating the well-known Hsiao code is to construct a {0, 1}-check-matrix in which each column contains the same odd-number of 1’s and each row contains the same number of 1’s or differs at most by one for the number of 1’s. We also require that no two columns are identical in the matrix. The author solved this problem in 1986 by introducing a type of recursively balanced matri...
متن کاملA computational algorithm for special nth-order pentadiagonal Toeplitz determinants
In this short note, we present a fast and reliable algorithm for evaluating special nth-order pentadiagonal Toeplitz determinants in linear time. The algorithm is suited for implementation using Computer Algebra Systems (CAS) such as MACSYMA and MAPLE. Two illustrative examples are given. 2007 Elsevier Inc. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2010
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2009.12.020